Compacting oblivious agents on dynamic rings
نویسندگان
چکیده
منابع مشابه
How to Gather Asynchronous Oblivious Robots on Anonymous Rings
A set of robots arbitrarily placed on the nodes of an anonymous graph have to meet at one common node and remain in there. This problem is known in the literature as the gathering. Robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), decides whether to stay idle or to move to one of its neighbors (Compute), and in the latter cas...
متن کاملDynamic Interval Routing on Asynchronous Rings
We consider the problem of routing in an asynchronous dynamically changing ring of processors using schemes that minimize the storage space for the routing information. In general, applying static techniques to a dynamic network would require significant re-computation. Moreover, the known dynamic techniques applied to the ring lead to inefficient schemes. In this paper we introduce a new techn...
متن کاملGathering in Dynamic Rings
The gathering (or multi-agent rendezvous) problem requires a set of mobile agents, arbitrarily positioned at different nodes of the network to group within finite time at the same location, not fixed in advanced. The extensive existing literature on this problem shares the same fundamental assumption that the topological structure does not change during the rendezvous or the gathering; this is ...
متن کاملEnhancing Oblivious RAM Performance Using Dynamic Prefetching
Oblivious RAM (ORAM) is an established technique to hide the access pattern to an untrusted storage system. With ORAM, a curious adversary cannot tell what data address the user is accessing when observing the bits moving between the user and the storage system. All existing ORAM schemes achieve obliviousness by adding redundancy to the storage system, i.e., each access is turned into multiple ...
متن کاملCompacting XML Structures Using a Dynamic Labeling Scheme
Due to the growing popularity of XML as a data exchange and storage format, the need to develop efficient techniques for storing and querying XML documents has emerged. A common approach to achieve this is to use labeling techniques. However, their main problem is that they either do not support updating XML data dynamically or impose huge storage requirements. On the other hand, with the verbo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PeerJ Computer Science
سال: 2021
ISSN: 2376-5992
DOI: 10.7717/peerj-cs.466